Wadge Degrees of $\omega$-Languages of Petri Nets
نویسنده
چکیده
We prove that ω-languages of (non-deterministic) Petri nets and ω-languages of (non-deterministic) Turing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Petri nets are equal to the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Turing machines which also form the class of effective analytic sets. In particular, for each non-null recursive ordinal α < ωCK 1 there exist some Σ 0 α-complete and some Πα-complete ω-languages of Petri nets, and the supremum of the set of Borel ranks of ω-languages of Petri nets is the ordinal γ1 2 , which is strictly greater than the first non-recursive ordinal ω CK 1 . We also prove that there are some Σ1-complete, hence non-Borel, ω-languages of Petri nets, and that it is consistent with ZFC that there exist some ω-languages of Petri nets which are neither Borel nor Σ1-complete. This answers the question of the topological complexity of ω-languages of (non-deterministic) Petri nets which was left open in [9, 19].
منابع مشابه
The Wadge Hierarchy of Petri Nets ω-Languages
We describe the Wadge hierarchy of the ω-languages recognized by deterministic Petri nets. This is an extension of the celebrated Wagner hierarchy which turned out to be the Wadge hierarchy of the ω-regular languages. Petri nets are more powerful devices than finite automata. They may be defined as partially blind multi-counter automata. We show that the whole hierarchy has height ω 2 , and giv...
متن کاملOn the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets
We show that there are Σ 3 -complete languages of infinite words accepted by non-deterministic Petri nets with Büchi acceptance condition, or equivalently by Büchi blind counter automata. This shows that ω-languages accepted by non-deterministic Petri nets are topologically more complex than those accepted by deterministic Petri nets.
متن کاملWadge hierarchy of omega context-free languages
The main result of this paper is that the length of the Wadge hierarchy of omega context-free languages is greater than the Cantor ordinal 0, and the same result holds for the conciliating Wadge hierarchy, de1ned by Duparc (J. Symbolic Logic, to appear), of in1nitary context-free languages, studied by Beauquier (Ph.D. Thesis, Universit9 e Paris 7, 1984). In the course of our proof, we get resul...
متن کاملOn the ω-language Expressive Power of Extended Petri Nets
In this paper, we study the expressive power of several monotonic extensions of Petri nets. We compare the expressive power of Petri nets, Petri nets extended with nonblocking arcs and Petri nets extended with transfer arcs, in terms of ω-languages. We show that the hierarchy of expressive powers of those models is strict. To prove these results, we propose original techniques that rely on well...
متن کامل